Discrete Reliability for Crouzeix-Raviart FEMs
نویسندگان
چکیده
The discrete reliability states that the difference of the discrete solutions on two arbitrary levels u` and u`+m with respect to triangulations T` and T`+m is bounded by the contributions of the residual-based error estimator on the refined simplices T` \ T`+m only. After some natural split of the error, the additional difficulty for the nonconforming FEMs is to bound min v`+m∈CR(T`+m) ‖∇NC(u` − v`+m)‖2L2(Ω)
منابع مشابه
Nonconforming FEMs for an Optimal Design Problem
Some optimal design problems in topology optimization eventually lead to a degenerate convex minimization problem E(v) := ∫ Ω W (∇v)dx − ∫ Ω f v dx for v ∈ H1 0 (Ω) with possibly multiple minimizers u, but with a unique stress σ := DW (∇u). This paper proposes the discrete Raviart–Thomas mixed finite element method (dRT-MFEM) and establishes its equivalence with the Crouzeix–Raviart nonconformi...
متن کاملGradient Recovery for the Crouzeix-Raviart Element
A gradient recovery method for the Crouzeix–Raviart element is proposed and analyzed. The proposed method is based on local discrete least square fittings. It is proven to preserve quadratic polynomials and be a bounded linear operator. Numerical examples indicate that it can produce a superconvergent gradient approximation for both elliptic equations and Stokes equations. In addition, it provi...
متن کاملN-simplex Crouzeix-raviart Element for the Second-order Elliptic/eigenvalue Problems
We study the n-simplex nonconforming Crouzeix-Raviart element in approximating the n-dimensional second-order elliptic boundary value problems and the associated eigenvalue problems. By using the second Strang Lemma, optimal rate of convergence is established under the discrete energy norm. The error bound is also valid for the eigenfunction approximations. In addition, when eigenfunctions are ...
متن کاملNeumann–neumann Algorithms for a Mortar Crouzeix–raviart Element for 2nd Order Elliptic Problems
The paper proposes two scalable variants of the Neumann–Neumann algorithm for the lowest order Crouzeix–Raviart finite element or the nonconforming P1 finite element on nonmatching meshes. The overall discretization is done using a mortar technique which is based on the application of an approximate matching condition for the discrete functions, requiring function values only at the mesh interf...
متن کاملCrouzeix-Raviart boundary elements
This paper establishes a foundation of non-conforming boundary elements. We present a discrete weak formulation of hypersingular integral operator equations that uses Crouzeix–Raviart elements for the approximation. The cases of closed and open polyhedral surfaces are dealt with. We prove that, for shape regular elements, this non-conforming boundary element method converges and that, up to log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 51 شماره
صفحات -
تاریخ انتشار 2013